<HTML><HEAD><TITLE>library(grasper)</TITLE></HEAD><BODY>
[ <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]<H1>library(grasper)</H1>
Finite Graphs Constraints Library
<H2>Predicates</H2>
<BLOCKQUOTE>
<DL>
<DT><A HREF="asymmetric-1.html"><STRONG>asymmetric(+Graph)</STRONG></A></DT>
<DD>Ensures Graph is asymmetric</DD>
<DT><A HREF="complementary_graph-2.html"><STRONG>complementary_graph(+Graph, ?ComplementaryGraph)</STRONG></A></DT>
<DD>Obtains the complementary graph of a given graph.</DD>
<DT><A HREF="connected-1.html"><STRONG>connected(+Graph)</STRONG></A></DT>
<DD>Guarantees that an undirected graph Graph is connected.</DD>
<DT><A HREF="dirgraph-3.html"><STRONG>dirgraph(-Graph, +VertexSet, +EdgeSet)</STRONG></A></DT>
<DD>Directed graph constructor.</DD>
<DT><A HREF="export_graph-2.html"><STRONG>export_graph(+Graph, ++File)</STRONG></A></DT>
<DD>Exports Graph to Filename in a .dot format which can then be loaded by GraphViz.</DD>
<DT><A HREF="getEdgeSet-2.html"><STRONG>getEdgeSet(+Graph, ?EdgeSet)</STRONG></A></DT>
<DD>Obtains a graph's edge-set.</DD>
<DT><A HREF="getVertexSet-2.html"><STRONG>getVertexSet(+Graph, ?VertexSet)</STRONG></A></DT>
<DD>Obtains a graph's vertex-set.</DD>
<DT><A HREF="graph_labeling-1.html"><STRONG>graph_labeling(+Graph)</STRONG></A></DT>
<DD>Labels a graph variable.</DD>
<DT><A HREF="graph_labeling-3.html"><STRONG>graph_labeling(+Graph, ++VertexHeuristic, ++EdgeHeuristic)</STRONG></A></DT>
<DD>Labels a graph variable using VertexHeuristic and EdgeHeuristic.</DD>
<DT><A HREF="order-2.html"><STRONG>order(+Graph, ?Order)</STRONG></A></DT>
<DD>Obtains a graph's order.</DD>
<DT><A HREF="oriented_graph-2.html"><STRONG>oriented_graph(+UndirectedGraph, ?DirectedGraph)</STRONG></A></DT>
<DD>Obtains an oriented graph of a given undirected graph.</DD>
<DT><A HREF="path-3.html"><STRONG>path(+Graph, +OriginVertex, +TerminusVertex)</STRONG></A></DT>
<DD>Ensures Graph represents a path between OriginVertex and TerminusVertex in Graph.</DD>
<DT><A HREF="predecessors-3.html"><STRONG>predecessors(+Graph, +Vertex, ?PredSet)</STRONG></A></DT>
<DD>Determines the predecessor-set of a vertex in a graph.</DD>
<DT><A HREF="reachables-3.html"><STRONG>reachables(+Graph, +SourceVertex, ?ReachSet)</STRONG></A></DT>
<DD>Determines the reachables-set of a vertex in a graph.</DD>
<DT><A HREF="reverse_graph-2.html"><STRONG>reverse_graph(+Graph, ?ReverseGraph)</STRONG></A></DT>
<DD>Obtains the reverse graph of a given graph.</DD>
<DT><A HREF="size-2.html"><STRONG>size(+Graph, ?Size)</STRONG></A></DT>
<DD>Obtains a graph's size.</DD>
<DT><A HREF="strongly_connected-1.html"><STRONG>strongly_connected(+Graph)</STRONG></A></DT>
<DD>Guarantees that a directed graph Graph is strongly connected.</DD>
<DT><A HREF="subgraph-2.html"><STRONG>subgraph(?SubGraph, +Graph)</STRONG></A></DT>
<DD>Constraints SubGraph to be a subgraph of Graph.</DD>
<DT><A HREF="successors-3.html"><STRONG>successors(+Graph, +Vertex, ?SuccSet)</STRONG></A></DT>
<DD>Determines the successor-set of a vertex in a graph.</DD>
<DT><A HREF="symmetric-1.html"><STRONG>symmetric(+Graph)</STRONG></A></DT>
<DD>Ensures Graph is symmetric</DD>
<DT><A HREF="underlying_graph-2.html"><STRONG>underlying_graph(+DirectedGraph, ?UndirectedGraph)</STRONG></A></DT>
<DD>Obtains an underlying graph of a given directed graph.</DD>
<DT><A HREF="undirgraph-3.html"><STRONG>undirgraph(-Graph, +VertexSet, +EdgeSet)</STRONG></A></DT>
<DD>Unirected graph constructor.</DD>
<DT><A HREF="weakly_connected-1.html"><STRONG>weakly_connected(+Graph)</STRONG></A></DT>
<DD>Guarantees that a directed graph Graph is weakly connected.</DD>
<DT><A HREF="weight-3.html"><STRONG>weight(+Graph, +WeightHash, ?Weight)</STRONG></A></DT>
<DD>Calculates the Weight of Graph given a WeightHash.</DD>
</DL>
</BLOCKQUOTE>
<H2>Description</H2>
<P>
    Graph-based constraint programming can be declaratively used for path
    and circuit finding problems, to routing, scheduling and allocation
    problems, among others.  CP(Graph) was proposed by G.  Dooms et al. 
    as a general approach to solve graph-based constraint problems.  It
    provides a key set of basic constraints which represent the
    framework's core, and higher level constraints for solving path
    finding and optimization problems, and to enforce graph properties.
    </P><P>
    The GRASPER (GRAph constraint Satisfaction Problem solvER) library
    is an alternative framework for graph-based constraint solving
    based on Cardinal, a finite sets constraint solver with extra
    inferences developed in Universidade Nova de Lisboa.  It provides
    a set of basic constraints which represent the core of our
    framework and functionality for directed graphs, graph weighting,
    graph matching, graph path optimization problems and some of the
    most common graph properties.
    </P><P>
    More information in this
    <A HREF="http://www.springerlink.com/content/553x1733661l6k31/fulltext.pdf">background paper</A>.
    </P>

<H2>About</H2><UL COMPACT>
<LI><STRONG>Status: </STRONG>prototype
<LI><STRONG>Author: </STRONG>Ruben Duarte Viegas, CENTRIA
<LI><STRONG>Date: </STRONG>$DATE$
</UL>
<H2>See Also</H2>
<A HREF="../../lib_public/cardinal/index.html">library(cardinal)</A><HR>Generated from grasper.eci on 2009-05-27 01:25
</BODY></HTML>
